Adequate encodings of logical systems in UTT
نویسندگان
چکیده
In this paper we present an existing and formalized type theory UTT Luo Goguen as a logical framework We compare the resulting frame work with LF Harper et al and give the representation of two signi cant type systems in the framework the typed lambda calculus which is closely related to higher order logic and a linear type system which is not possible to encode in LF
منابع مشابه
Adequate Encodings of Proof Systems for Algebraic Speciications in Utt
In this paper, we give an adequate encoding of a sound proof system with respect to the sound and complete proof system for algebraic speciications with structuring mechanisms and observability operators presented in 4]. We use a similar principle of encoding to the one used in LF ((3]), but we use a diierent type theory. We use the Uniform Theory of Dependent Types (UTT 2], 6]).
متن کاملA Logic for Constrained Process Calculi with Applications to Molecular Biology
Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal extension of intuitionistic linear logic where logical truth is indexed by constraints and hybrid connectives combine constraint reasoning with logical reasoning. T...
متن کاملProof assistance for refinement in type theory
In this paper we represent in type theory a proof system for re ne ment of algebraic speci cations in ASL The representation is not adequate but full because the use of proof obligations to represent side conditions Using this representation we can develop a proof tactic to help the development of proofs of re nement Introduction Type theories were initially used as a logical language for the f...
متن کاملA Natural Deduction Approach to Dynamic Logic
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory, such as LEGO, Coq, etc. In fact, ND-style systems are the kind of systems which can take best advantage of the possibility of reasoning “under assumptions” offered by proof assistants generated by Logical Frameworks....
متن کاملOn Equivalence and Canonical Forms in the Lf Type Theory (extended Abstract)
Decidability of deenitional equality and conversion of terms into canonical form play a central role in the meta-theory of a type-theoretic logical framework. Most studies of deenitional equality are based on a connuent, strongly-normalizing notion of reduction. Coquand has considered a diierent approach, directly proving the correctness of a practical equivalance algorithm based on the shape o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016